Prefixless q-ary Balanced Codes
نویسنده
چکیده
We will present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information on the balancing index. Lookup tables for coding and decoding the prefix are avoided. Index Terms Constrained code, balanced code, running digital sum, Knuth code, error correction.
منابع مشابه
All q-ary equidistant 3-codes
The elements of {0, 1, . . . , q − 1} are called q-ary codewords of length n over a q-element alphabet. A code is a set of codewords. The Hammingdistance d(c1, c2) of two codewords c1 and c2 is the number of positions where they differ. A code C is called equidistant with distance d if the Hammingdistance of any two codewords is exactly d. Another, shorter name is: q-ary equidistant d-code. The...
متن کاملPerspectives on Balanced Sequences
We examine and compare several different classes of “balanced” block codes over q-ary alphabets, namely symbolbalanced (SB) codes, charge-balanced (CB) codes, and polaritybalanced (PB) codes. Known results on the maximum size and asymptotic minimal redundancy of SB and CB codes are reviewed. We then determine the maximum size and asymptotic minimal redundancy of PB codes and of codes which are ...
متن کاملConstruction of new completely regular q-ary codes from perfect q-ary codes
In this paper from q-ary perfect codes a new completely regular q-ary codes are constructed. In particular two new ternary completely regular codes are obtained from the ternary Golay [11,6,5] code and new families of q-ary completely regular codes are obtained from q-ary 1-perfect codes.
متن کاملA generalized concatenation construction for q-ary 1-perfect codes
We consider perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). In this paper, a generalized concatenation construction for q-ary 1-perfect codes is presented that allows us to construct q-ary 1-perfect codes of length (q − 1)nm + n +m from the given q-ary 1-perfect codes of length n = (q1 − 1)/(q − 1) and m = (q2 − 1)/(q − 1), where s1, s2 are ...
متن کاملNew multilevel codes over GF(q)
In this paper, we apply set partitioning to multi-dimensional signal spaces over GF(q), particularly GFq-l(q) and GFq(q), and show how to construct both multi-level block codes and multi-level trellis codes over GF(q). We present two classes of multi-level (n, k, d) block codes over GF(q) with block length n, number of information symbols k, and minimum ,1-1 • { d } distance d_n >_ d, where n =...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013